The Mixed Type Splitting Methods for Solving Fuzzy Linear Systems

We consider a class of fuzzy linear systems (FLS) and demonstrate some of the existing methods using the embedding approach for calculating the solution. The main aim in this paper is to design a class of mixed type splitting iterative methods for solving FLS. Furthermore, convergence analysis of the method is proved. Numerical example is illustrated to show the applicability of the methods and to show the efficiency of proposed algorithm

The Mixed Type Splitting Methods for Solving Fuzzy Linear Systems

We consider a class of fuzzy linear systems (FLS) and demonstrate some of the existing methods using the embedding approach for calculating the solution. The main aim in this paper is to design a class of mixed type splitting iterative methods for solving FLS. Furthermore, convergence analysis of the method is proved. Numerical example is illustrated to show the applicability of the methods and to show the efficiency of proposed algorithm

A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems

Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely different applications in real world eventualities. However, the uncertainty related to the inconsistent information and indeterminate information isn't properly expressed by fuzzy set. The neutrosophic set deals these forms of uncertainty. This paper presents a model for shortest path problem with various arrangements of integer-valued trapezoidal neutrosophic (INVTpNS) and integer-valued triangular neutrosophic (INVTrNS). We characterized this issue as Neutrosophic Shortest way problem (NSSPP). The established linear programming (LP) model solves the classical SPP that consists of crisp parameters

Federated learning optimization: A computational blockchain process with offloading analysis to enhance security

The Internet of Things (IoT) technology in various applications used in data processing systems requires high security because more data must be saved in cloud monitoring systems. Even though numerous procedures are in place to increase the security and dependability of data in IoT applications, the majority of outside users can decode any transferred data at any time. Therefore, it is essential to include data blocks that, under any circumstance, other external users cannot understand. The major significance of proposed method is to incorporate an offloading technique for data processing that is carried out by using block chain technique where complete security is assured for each data. Since a problem methodology is designed with respect to clusters a load balancing technique is incorporated with data weights where parametric evaluations are made in real time to determine the consistency of each data that is monitored with IoT. The examined outcomes with five scenarios process that projected model on offloading analysis with block chain proves to be more secured thereby increasing the accuracy of data processing for each IoT applications to 89%

A New Approach for Solving Fully Fuzzy Linear Programming by Using the Lexicography Method

The fully fuzzy linear programming (FFLP) problem has many different applications in sciences and engineering, and various methods have been proposed for solving this problem. Recently, some scholars presented two new methods to solve FFLP. In this paper, by considering the L-R fuzzy numbers and the lexicography method in conjunction with crisp linear programming, we design a new model for solving FFLP. The proposed scheme presented promising results from the aspects of performance and computing efficiency. Moreover, comparison between the new model and two mentioned methods for the studied problem shows a remarkable agreement and reveals that the new model is more reliable in the point of view of optimality

Optimizing Resource Discovery Technique in the P2P Grid Systems

Distributed discovery service is a main concept in the scalable and dynamic grid environments. In this paper, based on the super-peer technique, we propose a new topology for the grid discovery service. The model is designed in such a way that each super-peer within the cluster has the routing indices (RIs) based on cobweb and uses the hop-count routing index (HRI) to select the best neighbor. Besides, each super-peer includes a cache table, which stores the query and the query results. Furthermore, from the point of view of the response time and the number of submitted messages, we compare the new model with an existing method. An illustrative simulation is also presented to show the efficiency and validation of the new technique

A new approach for solving fully fuzzy linear fractional programming problems using the multi-objective linear programming

This paper deals with developing an efficient algorithm for solving the fully fuzzy linear fractional programming problem. To this end, we construct a new method which is obtained from combination of Charnes−Cooper scheme and the multi-objective linear programming problem. Furthermore, the application of the proposed method in real life problems is presented and this method is compared with some existing methods. The numerical experiments and comparative results presented promising results to find the fuzzy optimal solution